<title>01背包</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cm">/*</span>
<span class="pl-cm">10 4</span>
<span class="pl-cm">2 1</span>
<span class="pl-cm">3 3</span>
<span class="pl-cm">4 5</span>
<span class="pl-cm">7 9</span>
<span class="pl-cm">*/</span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span> <span class="pl-cpf">&lt;iostream&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">maxn</span><span class="pl-o">=</span><span class="pl-mi">1000</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">,</span><span class="pl-n">maxv</span><span class="pl-o">=</span><span class="pl-mi">10000</span><span class="pl-o">+</span><span class="pl-mi">5</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">v</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">],</span><span class="pl-n">c</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">],</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">maxn</span><span class="pl-p">][</span><span class="pl-n">maxv</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
    <span class="pl-kt">int</span> <span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-n">n</span><span class="pl-p">;</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">n</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">v</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">],</span><span class="pl-o">&amp;</span><span class="pl-n">c</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">n</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">i</span><span class="pl-p">)</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-o">++</span><span class="pl-n">j</span><span class="pl-p">)</span>
            <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">j</span><span class="pl-o">&lt;</span><span class="pl-n">v</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">];</span>
            <span class="pl-k">else</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-p">],</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">][</span><span class="pl-n">j</span><span class="pl-o">-</span><span class="pl-n">v</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]]</span><span class="pl-o">+</span><span class="pl-n">c</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">n</span><span class="pl-p">][</span><span class="pl-n">m</span><span class="pl-p">]);</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>